Message-Passing Estimation from Quantized Samples

نویسندگان

  • Ulugbek Kamilov
  • Vivek K. Goyal
  • Sundeep Rangan
چکیده

Recently, relaxed belief propagation and approximate message passing have been extended to apply to problems with general separable output channels rather than only to problems with additive Gaussian noise. We apply these to estimation of signals from quantized samples with minimum mean-squared error. This provides a remarkably effective estimation technique in three settings: an oversampled dense signal; an undersampled sparse signal; and any signal when the quantizer is not regular. The error performance can be accurately predicted and tracked through the state evolution formalism. We use state evolution to optimize quantizers and discuss several empirical properties of the optimal quantizers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preserving communication bandwidth with a gradient coding scheme

Large–scale machine learning involves the communicaiton of gradients, and large models often saturate the communication bandwidth to communicate gradients. I implement an existing scheme, quantized stochastic gradient descent (QSGD) to reduce the communication bandwidth. This requires a distributed architecture and we choose to implement a parameter server that uses the Message Passing Interfac...

متن کامل

LMMSE Estimation and Interpolation of Continuous-Time Signals from Discrete-Time Samples Using Factor Graphs

The factor graph approach to discrete-time linear Gaussian state space models is well developed. The paper extends this approach to continuous-time linear systems / filters that are driven by white Gaussian noise. By Gaussian message passing, we then obtain MAP / MMSE / LMMSE estimates of the input signal, or of the state, or of the output signal from noisy observations of the output signal. Th...

متن کامل

MAP Estimation, Message Passing, and Perfect Graphs

Efficiently finding the maximum a posteriori (MAP) configuration of a graphical model is an important problem which is often implemented using message passing algorithms. The optimality of such algorithms is only well established for singly-connected graphs and other limited settings. This article extends the set of graphs where MAP estimation is in P and where message passing recovers the exac...

متن کامل

A reduced-complexity scheme using message passing for location tracking

This article presents a low-complexity and high-accuracy algorithm using message-passing approach to reduce the computational load of the traditional tracking algorithm for location estimation. In the proposed tracking scheme, a state space model for the location-estimation problem can be divided into many mutual-interaction local constraints based on the inherent message-passing features of fa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1105.6368  شماره 

صفحات  -

تاریخ انتشار 2011